/*************************************************************************
	> File Name: B2105.cpp
	> Author: yufangze
	> Mail: 2224590123@qq.com
	> Created Time: 2025-01-08 18:04:12
 ************************************************************************/

#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;

#define MAX_N 1000
int a[MAX_N + 5][MAX_N + 5], b[MAX_N + 5][MAX_N + 5], c[MAX_N + 5][MAX_N + 5];

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scanf("%d", &a[i][j]);
        }
    }
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= k; j++) {
            scanf("%d", &b[i][j]);
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            for (int p = 1; p <= m; p++) {
                c[i][j] += a[i][p] * b[p][j];
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            cout << c[i][j] << " ";
        } 
        cout << endl;
    }
    return 0;
}
